AN ITERATIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN THE SOLUTION SET OF SPLIT FIXED POINT PROBLEM
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFinding Minimum Norm Fixed Point of Nonexpansive Mappings and Applications
Iterative algorithms for finding fixed point of nonexpansive mappings are very interesting topic due to the fact that many nonlinear problems can be reformulated as fixed point equations of nonexpansive mappings. Related works can be found in 1–32 . On the other hand, we notice that it is quite often to seek a particular solution of a given nonlinear problem, in particular, the minimum-norm sol...
متن کاملA recursive algorithm for the infinity-norm fixed point problem
We present the PFix algorithm for the fixed point problem f ðxÞ 1⁄4 x on a nonempty domain 1⁄2a; b ; where dX1; a; bAR ; and f is a Lipschitz continuous function with respect to the infinity norm, with constant qp1: The computed approximation x̃ satisfies the residual criterion jj f ðx̃Þ x̃jjNpe; where e40: In general, the algorithm requires no more than Pd i1⁄41s i function component evaluations,...
متن کاملMultidirectional hybrid algorithm for the split common fixed point problem and application to the split common null point problem
In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. ...
متن کاملA Recursive Algorithm for Finding the Minimum Norm Point in an Unbounded Polyhedron
We present a recursive algorithm for finding the minimum norm point in an unbounded, wnvex and pointed polyhedron defined by finite sets of points and rays. The algorithm can start at an arbitrary point of the polyhedron and does not require to solve systems of linear equations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TNU Journal of Science and Technology
سال: 2021
ISSN: 2615-9562,2734-9098
DOI: 10.34238/tnu-jst.4024